NP-complete problems

Results: 1536



#Item
701NP-complete problems / Degeneracy / Vertex cover / Kernelization / Neighbourhood / Clique / Graph operations / Connectivity / Tree / Graph theory / Mathematics / Theoretical computer science

IEEE/ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, VOL. XX, NO. X, JANUARY 201X 1 Partitioning Biological Networks into Highly Connected Clusters

Add to Reading List

Source URL: fpt.akt.tu-berlin.de

Language: English - Date: 2014-01-08 11:56:00
702Computational complexity theory / Abstract algebra / Linear algebra / NP-complete problems / Logic in computer science / Boolean satisfiability problem / Time complexity / PP / Element distinctness problem / Theoretical computer science / Mathematics / Algebra

Chicago Journal of Theoretical Computer Science The MIT Press Volume 1999, Article 8 Lower Bounds for Linear Satisfiability Problems ISSN 1073–0486. MIT Press Journals, Five Cambridge Center, Cambridge,

Add to Reading List

Source URL: cjtcs.cs.uchicago.edu

Language: English - Date: 1999-10-13 17:17:56
703NP-complete problems / Graph partition / Graph / Matching / Hypergraph / Domatic number / Graph theory / Theoretical computer science / Mathematics

Microsoft PowerPoint - K-Anonymity.ppt

Add to Reading List

Source URL: www.andrew.cmu.edu

Language: English - Date: 2012-08-22 17:30:01
704NP-complete problems / Graph operations / Dominating set / Neighbourhood / Tree decomposition / Tree / Planar graph / Graph / Degree / Graph theory / Mathematics / Theoretical computer science

Approximating k-center in planar graphs David Eisenstat∗ Philip N. Klein∗ Abstract

Add to Reading List

Source URL: www.di.ens.fr

Language: English - Date: 2013-10-10 10:36:31
705Uriel Feige / NP-complete problems / Computational complexity theory / Adi Shamir / Symposium on Theory of Computing / International Colloquium on Automata /  Languages and Programming / Symposium on Foundations of Computer Science / Approximation algorithm / Uriel / Theoretical computer science / Applied mathematics / Mathematics

Uriel Feige, Publications, JanuaryPapers are sorted by categories. For papers that have more than one version (typically, journal version and conference proceedings), the different versions are combined into one

Add to Reading List

Source URL: www.wisdom.weizmann.ac.il

Language: English - Date: 2015-01-02 09:14:39
706NP-complete problems / Set cover problem / Randomized algorithm / Theoretical computer science / Computational complexity theory / Mathematics

Hardness of Set Cover with Interse tion 1 V.S.Anil Kumar1 , Sunil Arya2 and H.Ramesh3 MPI fur Informatik, Saarbru ken. kumarmpi-sb.mpg.de Department of Computer S ien e, Hong Kong University of S ien e and Te hnology.

Add to Reading List

Source URL: www.cse.ust.hk

Language: English - Date: 2006-04-04 10:28:02
707Graph operations / Connectivity / Tree decomposition / Graph / Travelling salesman problem / Tree / Line graph / Chordal graph / Graph theory / NP-complete problems / Graph coloring

Algorithms CS 6820 Fall 2009 Problem Set 5 Due November 11, 2009

Add to Reading List

Source URL: www.cs.cornell.edu

Language: English - Date: 2009-10-30 17:40:59
708NP-complete problems / Graph operations / Tree decomposition / Vertex cover / Minor / Planar graph / Dynamic programming / Path decomposition / Apex graph / Graph theory / Theoretical computer science / Mathematics

Graph Pricing Problem on Bounded Treewidth, Bounded Genus and k-Partite Graphs

Add to Reading List

Source URL: cjtcs.cs.uchicago.edu

Language: English - Date: 2013-11-08 11:23:34
709NP-complete problems / Graph operations / Clique problem / Clique / Independent set / Matching / Networks / Maximal independent set / Cograph / Graph theory / Theoretical computer science / Mathematics

LNCSA Continuous-Based Approach for Partial Clique Enumeration

Add to Reading List

Source URL: www.dsi.unive.it

Language: English - Date: 2010-08-27 12:12:13
710Graph / Matching / NP-complete problems / Matroid theory / Graph theory / Theoretical computer science / Mathematics

Information Theoretic Prototype Selection for Unattributed Graphs Lin Han1 , Luca Rossi2 , Andrea Torsello2 , Richard C. Wilson1 , and Edwin R. Hancock1 2

Add to Reading List

Source URL: www.cs.bham.ac.uk

Language: English - Date: 2015-03-30 09:05:08
UPDATE